The Unification Type of ACUI w.r.t. the Unrestricted Instantiation Preorder is not Finitary
نویسندگان
چکیده
The unification type of an equational theory is defined using a preorder on substitutions, called the instantiation preorder, whose scope is either restricted to the variables occurring in the unification problem, or unrestricted such that all variables are considered. It is known that the unification type of an equational theory may vary, depending on which instantiation preorder is used. More precisely, it was shown that the theory ACUI of an associative, commutative, and idempotent binary function symbol with a unit is unitary w.r.t. the restricted instantiation preorder, but not unitary w.r.t. the unrestricted one. Here, we improve on this result, by showing that, w.r.t. the unrestricted instantiation preorder, ACUI is not even finitary.
منابع مشابه
The Exact Unification Type of Commutative Theories
The exact unification type of an equational theory is based on a new preorder on substitutions, called the exactness preorder, which is tailored towards transferring decidability results for unification to disunification. We show that two important results regarding the unification type of commutative theories hold not only for the usual instantiation preorder, but also for the exactness preord...
متن کاملUnification Modulo ACU I Plus Homomorphisms/Distributivity
E-unification problems are central in automated deduction. In this paper, we consider theories that are extensions of the well-known ACI or ACUI , obtained by adding finitely many homomorphism symbols, or a symbol ‘∗’ that distributes over the ACUIsymbol denoted ‘+’. We first show that when we adjoin a set of commuting homomorphisms to ACUI , unification is undecidable. We then consider the ACU...
متن کاملA semantic theory for value-passing processes based on the late approach
A general class of languages for value-passing calculi based on the late semantic approach is defined and a concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. Three kinds of semantics are given for this language. First a Plotkin style operational semantics by means of an applicative labelled transition system is intr...
متن کاملExact Unification and Admissibility
A new hierarchy of “exact” unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by instantiation, but rather by inclusion over the corresponding sets of unified identities. Minimal complete sets of unifiers under this new preordering always h...
متن کامل2 9 M ar 2 00 8 The Best Possible Unification for Any Collection of Physical Theories
It is shown that the set of all finitary consequence operators defined on any nonempty language is a join-complete lattice. This result is applied to various collections of physical theories to obtain an unrestricted supremum unification.
متن کامل